POPMUSIC for a real-world large-scale vehicle routing problem with time windows

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

POPMUSIC for a real-world large-scale vehicle routing problem with time windows

This paper presents a heuristic approach based on the POPMUSIC framework for a large scale Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) derived from real world data. Popmusic is a very powerful tool for tackling large problem instances. A Memetic Algorithm (MA) is used as an optimiser in the Popmusic framework. It is shown that a population based search combined with decompos...

متن کامل

PopMusic for Real World Large Scale Multi Depot Vehicle Routing Problem with Time Windows

In this paper we consider a large scale Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) that was derived from a large Austrian logistics provider. The developed algorithm is based on the PopMusic framework developed by Taillard and Voss [2] and uses a specially designed Memetic Algorithm (MA) as optimizer. The MA was chosen as it is easy to be integrated into the framework as we...

متن کامل

A goal programming model for vehicle routing problem with backhauls and soft time windows

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

متن کامل

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

Evolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority

A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operational Research Society

سال: 2009

ISSN: 0160-5682,1476-9360

DOI: 10.1057/palgrave.jors.2602633